Low-Rank and Row-Sparse Decomposition for Joint DOA Estimation and Distorted Sensor Detection
نویسندگان
چکیده
Distorted sensors could occur randomly and may lead to the breakdown of a sensor array system. We consider an model within which small number are distorted by unknown gain phase errors. With such model, problem joint direction-of-arrival (DOA) estimation detection is formulated under framework low-rank row-sparse decomposition. derive iteratively reweighted least squares (IRLS) algorithm solve resulting problem. The convergence property IRLS analyzed means monotonicity boundedness objective function. Extensive simulations conducted regarding parameter selection, speed, computational complexity, performances DOA as well detection. Even though slightly worse than alternating direction method multipliers in detecting sensors, results show that our approach outperforms several state-of-the-art techniques terms cost, performance.
منابع مشابه
Sparse and Low-Rank Tensor Decomposition
Motivated by the problem of robust factorization of a low-rank tensor, we study the question of sparse and low-rank tensor decomposition. We present an efficient computational algorithm that modifies Leurgans’ algoirthm for tensor factorization. Our method relies on a reduction of the problem to sparse and low-rank matrix decomposition via the notion of tensor contraction. We use well-understoo...
متن کاملRank Aggregation via Low-Rank and Structured-Sparse Decomposition
Rank aggregation, which combines multiple individual rank lists to obtain a better one, is a fundamental technique in various applications such as meta-search and recommendation systems. Most existing rank aggregation methods blindly combine multiple rank lists with possibly considerable noises, which often degrades their performances. In this paper, we propose a new model for robust rank aggre...
متن کاملBeyond Low Rank + Sparse: A Multi-scale Low Rank Decomposition
We present a multi-scale version of low rank matrix decomposition. Our motivation comes from imaging applications, in which image sequences are correlated locally on several scales in space and time rather than globally. We model our data matrix as a sum of matrices, where each matrix has increasing scales of locally low-rank matrices. Using this multi-scale modeling, we can capture different s...
متن کاملImproved Deterministic Conditions for Sparse and Low-Rank Matrix Decomposition
In this paper, the problem of splitting a given matrix into sparse and low-rank matrices is investigated. The problem is when and how we can exactly do this decomposition. This problem is ill-posed in general and we need to impose some (sufficient) conditions to be able to decompose a matrix into sparse and low-rank matrices. This conditions can be categorized into two general classes: (a) dete...
متن کاملLow-Rank and Sparse Matrix Decomposition for Genetic Interaction Data
BACKGROUND Epistatic miniarray profile (EMAP) studies have enabled the mapping of large-scale genetic interaction networks and generated large amounts of data in model organisms. One approach to analyze EMAP data is to identify gene modules with densely interacting genes. In addition, genetic interaction score (S score) reflects the degree of synergizing or mitigating effect of two mutants, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Aerospace and Electronic Systems
سال: 2023
ISSN: ['1557-9603', '0018-9251', '2371-9877']
DOI: https://doi.org/10.1109/taes.2023.3241886